Parallel computer system and control method for parallel computer system

ABSTRACT

A parallel computer system includes a parallel computer including nodes connected via communication routes and respectively executing calculations, and a control device to allocate a job to a predetermined number of nodes. The control device includes a job allocation processor to allocate, to a peripheral region of first N-dimensional job nodes allocated with a first job, any of an empty node, a zero-dimensional job node, and a node at a side or a surface with one node length of M-dimensional job nodes, N=&lt;1 and M&lt;N, and a failure processor to, when a failure occurs in the first N-dimensional job nodes, allocate at least one node among the nodes in the peripheral region to a relay node, select a route passing through the relay node as an alternative route for a route with the failure, and execute communication among the nodes via the alternative route.

CROSS-REFERENCE TO RELATED APPLICATION

This application is based upon and claims the benefit of priority of theprior Japanese Patent Application No. 2014-160057, filed on Aug. 6,2014, the entire contents of which are incorporated herein by reference.

FIELD

The present invention relates to a parallel computer system and acontrol method for the parallel computer system.

BACKGROUND

A computer system that performs a high-performance calculation includesa node connection network in which a plurality of processors callednodes are connected by links. The plurality of nodes allocated with ajob such as calculation processing perform processing in parallel whilecommunicating with one another. The parallel computer system has higherperformance as the number of processors increases. At the same time, itis more likely that a failure occurs somewhere in the system.

As failures in a parallel computer system in which a large number ofprocessors are connected by links, there are failures of the processorsand memories in nodes, failures of routers in the nodes, anddisconnection of the links that connect the nodes. When a failure occurssomewhere during job execution, some measures need to be taken becauseexecution of a job being executed in a region including a failurelocation and a job executed using a communication route passing thefailure location is hindered.

Japanese Translation of PCT Application No. 2007-533031 and JapanesePatent Application Laid-Open No. H06-266684 describe processing for,when a node failure occurs, stopping a job of a subset including thefailed node, allocating a node to the job anew, and executing the job,processing for securing a channel for avoiding a failure route when acommunication route among processors fails, and interconnect of aparallel computer system.

SUMMARY

When an occurred failure is a failure of a router or a failure of alink, a communication route among nodes is interrupted. In that case, ifan alternative route replacing the interrupted communication route canbe established, a job can be continuously executed regardless of thefailure.

However, it may be sometimes impossible to establish the alternativerouter because of limitation of a hardware routing. By increasing thenumber of nodes to which a job is allocated and increasing a region sizeof a node group, it is possible to allocate a job to another node andresume the job. However, in a direct network such as mesh or torus, ingeneral, a node group of a job is allocated in a dense form such as arectangle or a rectangular parallelepiped. Therefore, when the size isincreased without deforming the rectangle or the rectangularparallelepiped, an excessive number of nodes need to be added. This issometimes against efficiency of the nodes.

One aspect of embodiment is a parallel computer system comprising:

a parallel computer including nodes connected via communication routesand configured to respectively execute calculations; and

a control device configured to allocate a job to a predetermined numberof nodes in the parallel computer, wherein

the control device includes:

a job allocation processor configured to allocate, to a peripheralregion of first N-dimensional job nodes allocated with a first job, anyof an empty node not allocated with a job, a zero-dimensional job nodeallocated with a job, and a node at a side or a surface with one nodelength of M-dimensional job nodes allocated with a job, N being equal toor greater than 1 and M being less than N; and

a failure processor configured to, when a failure occurs in the firstN-dimensional job node, allocate at least one node among the nodes inthe peripheral region to a relay node, select a route passing throughthe relay node as an alternative route for a communication route inwhich communication is hindered by the failure, and executecommunication among the nodes via the alternative route.

The object and advantages of the invention will be realized and attainedby means of the elements and combinations particularly pointed out inthe claims.

It is to be understood that both the foregoing general description andthe following detailed description are exemplary and explanatory and arenot restrictive of the invention.

BRIEF DESCRIPTION OF DRAWINGS

FIG. 1 is a diagram for explaining a first routing example of messagetransmission of a parallel computer.

FIG. 2 is a diagram for explaining a second routing example of messagetransmission of a parallel computer.

FIG. 3 is a diagram for explaining a third routing example of messagetransmission of a parallel computer.

FIG. 4 is a diagram for explaining extension of a region of a pluralnode group.

FIG. 5 is a diagram depicting the configurations of a parallel computersystem and a node in this embodiment.

FIG. 6 is a configuration diagram of an input/output device 33 in theparallel computer.

FIG. 7 is a diagram depicting the configuration of the control device ofthe parallel computer system.

FIG. 8 is a diagram depicting the configuration of the control device50.

FIG. 9 is a diagram depicting a job allocation example by the controldevice in this embodiment.

FIG. 10 is a flowchart of job allocation processing by the controldevice in this embodiment.

FIG. 11 is a diagram depicting a state halfway in the job allocationprocessing.

FIG. 12 is a diagram depicting an example of a first alternative routein this embodiment.

FIG. 13 is a diagram depicting an example of the second alternativeroute in this embodiment.

FIG. 14 is a diagram depicting an example of a third alternative routein this embodiment.

FIG. 15 is a flowchart of the failure processing in this embodiment.

FIG. 16 is a flowchart of the processing S18 of the restoration of thecommunication route in FIG. 15.

FIG. 17 is a flowchart of the selection processing for the relay node inthe peripheral region in the processing S28 in FIG. 16.

FIG. 18 is a diagram depicting the configuration of the relay node.

FIG. 19 is a diagram for explaining the routing of the alternative routethrough the relay node.

FIG. 20 is a diagram depicting an example of a node arranged in aperipheral region of the three-dimensional job nodes.

DESCRIPTION OF EMBODIMENTS

FIG. 1 is a diagram for explaining a first routing example of messagetransmission of a parallel computer. The parallel computer depicted inFIG. 1 is configured by the topology of a two-dimensional mesh andincludes a plurality of nodes ND that executes calculation and aplurality of links LN that respectively connect nodes. Each of the nodesND includes a processor, a memory, and a router. A control device notdepicted in the figure allocates a job, which is to be processed, to apredetermined number of nodes and controls execution of the job. Theprocessors of the plurality of nodes allocated with the job process thejob in parallel while exchanging messages with one another via links LN.

The routing of FIG. 1 is, as an example, dimension-order routing.According to the dimension-order routing, a shortest route from a startnode to an end node is determined under a limitation of a rule that therouting proceeds in an X-axis direction first and proceeds in a Y-axisdirection next. According to this rule, when the routing proceeds in theY-axis direction first, the routing may be unable to proceed in theX-axis direction next. Note that, when the parallel computer isconfigured by a three-dimensional mesh, a route by the dimension-orderrouting is determined under a limitation of a rule that the routingproceeds in the X-axis direction first, proceeds in the Y-axis directionnext, and finally proceeds in a Z-axis direction.

In FIG. 1, a communication route from a node with a number 1 to a nodewith a number 11 is configured by, as indicated by a broken line arrow10, a route in the X-axis direction from the node with the number 1 to anode with a number 3 and a route in the Y-axis direction from the nodewith the number 3 to the node with the number 11. However, when a routerof a node with a number 7 fails, the communication route in the Y-axisdirection from the node with the number 3 to the node with the number 11is interrupted. In this case, a communication route indicated by a solidline arrow 11 is a route bypassing a failure location F1. However, thecommunication route 11 may be unable to be used because thecommunication route is against the dimension-order routing. Therefore,it may be impossible to transmit a message packet from the node with thenumber 1 to the node with the number 11 bypassing the failure locationF1. A job being executed has to be stopped. The job has to be allocatedto another node group and resumed from the beginning. This causesdeterioration in efficiency of use of calculation resources.

FIG. 2 is a diagram for explaining a second routing example of messagetransmission of a parallel computer. The parallel computer depicted inFIG. 2 is configured by the topology of two-dimensional torus and isconfigured by a plurality of nodes ND and a plurality of links LN thatconnect the nodes ND. Links in the X-axis direction include links TR oftorus that connects a node at the right end and a node at the left endfor every rows. Similarly, links in the Y-axis direction include linksof torus for every columns, but not depicted.

The routing of FIG. 2 is, as an example, a West-First-Turn routing. Inthis case, a shortest route from a start node to an end node isdetermined under a limitation of a rule that a route in the westdirection has to be the first. A communication route from a node ND1 toa node ND2 includes, as indicated by a broken line arrow 12, a route inthe west direction first and a route in the north direction next.However, when failures occur in two places of failure spots F2 and F4and a router of a node in a failure location F3 fails, the communicationroute from the node ND1 to the node ND2 is interrupted. This is because,since an alternative route indicated by a solid line arrow 13 includes aroute in the west direction after a route in the north direction, thecommunication route is against a rule of West-First-Turn routing. Thatis, a route from a node C to a node B is not interrupted by occurrenceof three failure locations F2 to F4. However, an alternative route froma plurality of nodes A to the node B may be unable to be used.Therefore, it may be impossible to transmit messages among these nodes.A job being executed has to be stopped. The job has to be allocated toother nodes and resumed.

FIG. 3 is a diagram for explaining a third routing example of messagetransmission of a parallel computer. The parallel computer is configuredby the topology of a two-dimensional mesh. The routing of FIG. 3 isWest-First-Turn routing. Since the topology is not torus, when a routerof a node in a failure location F5 fails, a communication route 14 froma node ND3 to a node ND4 is interrupted. An alternative route indicatedby a solid line arrow 15 is unable to be used because the alternativeroute is against the West-First-Turn routing. Eventually, when a routepassing the failure location F5 is interrupted, communication routesfrom a plurality of nodes A to a plurality of nodes B are unable to beused. As a result, a job being executed has to be stopped. The job hasto be allocated to another node and resumed from the beginning. Ingeneral, in the case of the two-dimensional mesh, it is more difficultto select an alternative route because of occurrence of a failure thanin the case of the two-dimensional torus.

FIG. 4 is a diagram for explaining extension of a region of a pluralnode group. As explained above, when a failure occurs and there is noroute bypassing the failure location, a region of a node group allocatedwith a job needs to be extended. A stopped job needs to be allocated toa node added by the extension. However, when jobs are allocated to aplurality of nodes, in order to avoid interference among the jobs, anode group allocated with the job is preferably a dense shape such as arectangle or a rectangular parallelepiped.

In FIG. 4, when a certain job is allocated to a plural node region 20,it is assumed that mutual communication is unavailable in a region 21.In this case, a job executed in a node of the region 21 is stopped. Theplural node region 20 is extended to a plural node region 22. Theextended plural node region 22 is extended while maintaining a rectangleof the original plural node region 20. However, the number of nodes of anode group 23 to which the stopped job is allocated is sometimes smallerthan the number of nodes increased by the extension. As a result, only apart of the nodes increased by the extension is used. This causesdeterioration in efficiency of calculation resources.

Even if a failure occurs in a node region allocated with a job asexplained above, it is desired to prevent deterioration in efficiency ofcalculation resources while increasing possibility of selection of analternative route.

[Parallel Computer System in this Embodiment]

FIG. 5 is a diagram depicting the configurations of a parallel computersystem and a node in this embodiment. The parallel computer systemincludes a parallel computer 30 including a plurality of nodes ND thatexecutes calculation and a plurality of links LN that respectivelyconnects the nodes and a control device 50 that allocates a job to thenodes ND in the parallel computer and controls execution of the job. Theparallel computer 30 includes a node connection network 32 formed by theplurality of nodes ND and the links LN and an input/output device 33including a storage.

The node ND includes a CPU 40, which is a processor, a main storagedevice 41, and a router 42. The processor 40 is, for example, amulti-core processor including a plurality of CPU cores. A failuredetecting device 43 that detects a failure state of a node is providedin the node ND. Therefore, a job is allocated to the processor 40 in thenode ND. The processor 40 allocated with the job executes arithmeticprocessing of the job.

The processor 40 executes calculation and processes a job in parallelwhile exchanging messages with processors of the other nodes. When thenode is a start node of message communication, the router 42 transmits amessage to any of the links LN on the basis of a routing rule. When thenode is a via node through which the message is transmitted, the router42 routes a message propagated from a certain link LN to the next nodeon the basis of the routing rule with reference to an end coordinate ina header of the message and additional information needed for therouting.

The processor 40 of the node executes the allocated job. Whentransmitting a message, the processor 40 of the node generates, in thememory, a message packet in which a start coordinate and an endcoordinate is stored in a header. The router 42 transmits the messagepacket on the basis of the routing rule. When the processor 40 receivesthe message packet, if the end coordinate in the header is a coordinateof the processor 40, the processor 40 buffers the message packet in thememory and executes requisite processing. Further, the router 42 of thenode routes the packet to a transfer destination based on the routingrule with reference to the start coordinate and the end coordinate inthe header of the received message packet.

Therefore, when the node fails, and when the processor 40 fails,execution processing of the job by the node is disabled. The node may beunable to function as a start node and transmit the message packet, andfunction as an end node and receive the message packet. When the router42 fails, transmission and reception of a packet may be unable to betransmitted and received. Transfer of the packet may be unable to beperformed. When a link fails, for example, is disconnected, transmissionof a packet through the link may be unable to be performed.

FIG. 6 is a configuration diagram of an input/output device 33 in theparallel computer. The input/output device 33 includes a plurality oflarge-capacity storage media such as hard disks HDD. The input/outputdevice 33 includes host channel adapters HCA connected to the nodeconnection network 32, a switch 34, and target channel adapters TCA thatconnect the switch 34 and the HDDs. The processors of the plurality ofnodes in the node connection network 32 are accessible to thelarge-capacity storage media in the input/output device 33.

FIG. 7 is a diagram depicting the configuration of the control device ofthe parallel computer system. The control device 50 is, for example, aserver. Like the node connection network 32 of the parallel computer,the control device 50 may be configured by a plurality of nodes andlinks that connect the nodes. The control device 50 is connected to theplurality of nodes ND in the node connection network 32 of the parallelcomputer via a network 51 and switch groups 52.

FIG. 8 is a diagram depicting the configuration of the control device50. The control device 50 is a server device as explained above. Thecontrol device 50 includes a CPU, which is a processor, an input/outputdevice I/O, a main memory 52, and a network interface 53, which is aninterface with the network 51. In the main memory 52, a job allocationprogram 52-1 for allocating a job requested by a user to the nodes ofthe parallel computer and a failure processing program 52-2 forperforming failure processing when a failure occurs in the parallelcomputer are stored. The job allocation program 52-1 and the failureprocessing program 52-2 are executed by the processor CPU. In the mainmemory 52, a job queue 52-3 that stores a job requested by the user, ajob execution node storage table 52-4 that records a node which iscurrently executing a job, and a failure location storage table 52-5that records a failure location are stored.

In response to an execution request for a job from the input/outputdevice I/O by the user, the control device 50 enters the requested jobin the job queue 52-3. The processor CPU executes the job allocationprogram 52-1, allocates a job to a requisite number of nodes of theparallel computer, and controls an execution start of the job. At thesame time, the processor CPU registers a node that is currentlyexecuting the job in the job execution node storage table 52-4. Whenreceiving a failure detection notification from the failure detectingdevices 43 provided in the nodes, the processor CPU executes the failureprocessing program 52-2, registers a failure location and failurecontent in the failure location storage table 52-5, and performs failureprocessing explained below such as a stop and resumption of the job anda search for an alternative route.

[Job Allocation Processing]

In the parallel computer system in this embodiment, in order to increasethe possibility of establishment of an alternative route when ahindrance occurs in a communication route because of an occurredfailure, the control device allocates a job not allowed to be suspended,that is, a job having high importance, for which continuous execution isrequested, to the nodes as explained below.

FIG. 9 is a diagram depicting a job allocation example by the controldevice in this embodiment. In this example, the topology of the nodeconnection network 32 of the parallel computer is two-dimensional meshof 8×8. Routing is a West-First-Turn model. However, this embodiment canalso be applied to various kinds of topology such as any N-dimensionalmesh or N-dimensional torus and other routing models such asdimension-order routing.

In FIG. 9, nodes indicated by white circles are nodes to which a job isnot allocated and for which the processor does not execute calculation.The nodes are referred to as standby nodes or empty nodes E_ND. Nodesindicated by right upward oblique lines are nodes to each of which acertain job is respectively allocated and in which the job is beingexecuted. The nodes are referred to as zero-dimensional job nodes0D_JND. Nodes indicated by left upward oblique lines are a plurality ofnodes to which a job is allocated and in which the job is being executedand are nodes arranged in a certain one-dimensional direction. The nodesare referred to as one-dimensional job nodes 1D_JND. Further, nodesindicated by black circles are two-dimensionally arranged nodes to whicha job is allocated. The nodes are referred to as two-dimensional jobnodes 2D_JND.

In the example depicted in FIG. 9, for simplification, the topology is atwo-dimensional mesh. Therefore, the two-dimensional job nodes have amaximum number of dimensions. In the case of a three-dimensional mesh, ajob is sometimes allocated to three-dimensional job nodes of a maximumdimension. In general, in the case of a K-dimensional mesh, it ispossible to allocate a job to zero-dimensional to K-dimensional jobnodes.

In the empty node E_ND, a processor is stopped but a router routes amessage packet to be propagated. The zero-dimensional job node 0D_JND isexecuting a job with a single processor. Therefore, the zero-dimensionaljob node 0D_JND does not transmit and receive a message to and from theprocessors of the other nodes.

On the other hand, in the one-dimensional job nodes 1D_JND, a pluralityof nodes arranged in the one-dimensional direction calculates a job inparallel. Therefore, processors of the plurality of nodes in theone-dimensional job nodes transmit and receive a message to and from oneanother. In addition to routing a message in the one-dimensional jobnodes, a router routes a message among nodes outside the one-dimensionaljob nodes.

Job allocation processing by the control device in this embodiment isexplained. The control device 50 allocates a job requested by the userto a suitable number of nodes for a processing amount of the job. Whenthe job is allocated to a plurality of nodes, in order to avoidinterference with other jobs, the job is allocated to nodes in a regionhaving a dense shape such as a rectangle or a rectangularparallelepiped. That is, the job is not allocated to a region having anuneven external shape.

In the example depicted in FIG. 9, the topology is the two-dimensionalmesh. Therefore, the shape of the region of the job nodes to which thejob is allocated is three kinds, i.e., the zero-dimensional job node0D_JND, the one-dimensional job nodes 1D_JND, and the two-dimensionaljob nodes 2D_JND. When the topology is a three-dimensional mesh,three-dimensional job nodes are added. When the topology is anN-dimensional mesh, the job can be allocated up to N-dimensional jobnodes.

In FIG. 9, the control device 50 allocates jobs respectively to threetwo-dimensional job nodes 2D_JND1 to 3. It is assumed that, among thejob nodes, an important job, continuous execution of which is requested,is allocated to the two-dimensional job nodes 2D_JND1.

First, the control device 50 allocates any of the empty node E_ND, thezero-dimensional job node 0D_JND, and a node at one end of theone-dimensional job nodes 1D_JND to a peripheral region of thetwo-dimensional job nodes 2D_JND1 allocated with the important job, thatis, a peripheral region between an alternate long and short dash line 60and the two-dimensional job nodes 2D_JND1. In particular, in the case ofthe one-dimensional job nodes 1D_JND, the control device 50 allocatesthe one-dimensional job nodes 1D_JND such that only the node at one endof the one-dimensional shape is adjacent to the two-dimensional jobnodes 2D_JND1 of the important job. That is, the control device 50allocates the one-dimensional job nodes 1D_JND such that the side of theone-dimensional job nodes 1D_JND having one node length is in contactwith any of the sides of the two-dimensional job nodes 2D_JND1 of theimportant job.

In the example depicted in FIG. 9, five empty nodes E_ND, sevenzero-dimensional job nodes 0D_JND, and nodes on sides at one ends of twoone-dimensional job nodes 1D_JND are allocated to the peripheral regionof the two-dimensional job nodes 2D_JND1 of the important job.

The control device 50 allocates the two-dimensional job nodes 2D_JND1 ofthe important job such that the two-dimensional job nodes 2D_JND1 areadjacent to the two-dimensional job nodes 2D_JND2 and 2D_JND3 allocatedwith another job respectively, via the region (the peripheral region)between the alternate long and short dash line 60 and thetwo-dimensional job nodes 2D_JND1. That is, the control device 50arranges the two-dimensional job nodes 2D_JND1 of the important job notto be directly adjacent to the two-dimensional job nodes 2D_JND2 and2D_JND3 allocated with the other job.

In this way, the nodes explained above are arranged in the peripheralregion of the two-dimensional job nodes 2D_JND1 of the important job.Consequently, when a failure occurs in the two-dimensional job nodes2D_JND1, it is possible to increase possibility of establishing, usingthe nodes in the peripheral region, an alternative route replacing acommunication route interrupted by the failure. Above all, by allocatinga relay node to the empty node E_ND, possibility of establishing a firstalternative route from a start node of message communication to therelay node and a second alternative route from the relay node to an endnode increases.

The relay node has a relay function of detecting a communication routefrom a coordinate of the relay node to an end coordinate of a message,generating a message packet, and enabling a start of routing of themessage packet. By using the relay node, it is possible to increasepossibility of establishing an alternative route avoiding a failurelocation even under limitation of routing. However, the zero-dimensionaljob node or the node at one end of the one-dimensional job nodes can beallocated to the relay node, when an operating ratio of a core of a partof the processor in the zero-dimensional job node or the node at one endof the one-dimensional job nodes is zero or low. The relay node and thealternative route are explained in detail below.

Note that, in the example explained above, the important job isallocated to the two-dimensional job nodes 2D_JND1. However, theimportant job may be allocated to the one-dimensional job nodes. In thatcase as well, any of the empty node, the zero-dimensional job node, andthe node at the side with one node length of the one-dimensional jobnodes is allocated to the peripheral region of the one-dimensional jobnodes of the important job. In this case, the side of one node length ofthe one-dimensional job nodes needs to be allocated to be in contactwith the one-dimensional job nodes of the important job.

FIG. 10 is a flowchart of job allocation processing by the controldevice in this embodiment. FIG. 11 is a diagram depicting a statehalfway in the job allocation processing. The processor CPU of thecontrol device 50 executes a job allocation program and performs the joballocation processing explained below.

First, the control device 50 checks whether unexecuted job is present inthe job queue 52-3 (S1). If the unexecuted job is present (YES in S1),the control device 50 performs the next processing. If the unexecutedjob is not allocatable to the zero-dimensional job node or theone-dimensional job nodes (NO in S2), and if the unexecuted job is animportant job that needs to be continuously executed and there is anempty region of a node to which the job, which is to be continuouslyexecuted, can be allocated (YES in S5), the control device 50 allocatesthe job, which is to be continuously executed, to the empty region andstarts job execution (S6).

FIG. 11 depicts a state in which the job, which is to be continuouslyexecuted, is allocated to the region of the two-dimensional job nodes2D_JND1 in the empty region 60. In this example, the empty region 60 iswider or larger than the region of the two-dimensional job nodes 2D_JND1by one node in the four directions. That is, the peripheral region ofthe two-dimensional job nodes 2D_JND1 is secured.

Thereafter, if the unexecuted job is allocatable to the zero-dimensionaljob node or the one-dimensional job node (YES in S2) and if a job, whichis to be continuously executed, is being executed (YES in S3), thecontrol device 50 allocates the unexecuted job to a node in theperipheral region of the two-dimensional job nodes 2D_JND1, allocatedwith the job to be continuously executed, and causes the node to startexecution of the unexecuted job (S4). The control device 50 repeats thisprocessing for allocating the unexecuted job to the node in theperipheral region until the empty nodes E_ND in the peripheral regionreaches a minimum number needed. In this way, the allocation of theunexecuted job is repeated. Any of the empty node E_ND, thezero-dimensional job node 0D_JND, and the node at the one end of theone-dimensional job nodes 1D_JND is allocated to the peripheral regionof the two-dimensional job nodes 2D_JND1. The allocation is as depictedin FIG. 9. The two-dimensional job nodes 2D_JND1 allocated with theimportant job is not directly adjacent to the two-dimensional job nodes2D_JND 2 and 3 allocated with the other job but is adjacent to thetwo-dimensional job nodes 2D_JND2 and 3 via the peripheral region.

[Failure Processing]

In the parallel computer system in this embodiment, when a hindranceoccurs in the communication route because of a failure that occurs inthe two-dimensional job nodes of the important job, the control device50 allocates the relay node to the node in the peripheral region of thetwo-dimensional job nodes and establishes an alternative route for theinterrupted communication route. Possibility of establishing thealternative route for the communication route interrupted by the failureis increased by establishing the alternative route through the relaynode in which routing can be resumed with a new packet without beinglimited by routing.

FIG. 12 is a diagram depicting an example of a first alternative routein this embodiment. The topology of a node connection network, a routingrule, and allocation of a job in the node connection network in FIG. 12is the same as those in FIG. 9. As depicted in FIG. 12, it is assumedthat a failure F6 occurs in a center link in the two-dimensional jobnodes 2D_JND1 allocated with the important job that is to becontinuously executed. As a result, in the two-dimensional mesh and theWest-First-Turn routing, an alternative route for a communication routefrom a node ND6 to a node ND5 may be unable to be established in thetwo-dimensional job nodes 2D_JND1. This is because, as in the exampledepicted in FIG. 3, although a westward route is needed as the routefrom the node ND6 to the node ND5, it may be impossible to pass througha westward route from the node ND6 first because of the failure F6.

Therefore, in the failure processing, the control device 50 allocates arelay node R_ND to a node in the peripheral region of thetwo-dimensional job nodes 2D_JND1, desirably, an empty node. The controldevice 50 establishes an alternative route including a first alternativeroute AR11 from the start node ND6 to the relay node R_ND and a secondalternative route AR12 from the relay node R_ND to the end node ND5. Thecontrol device 50 installs a relay program in the selected relay nodeR_ND and starts the relay program. Therefore, the relay node R_ND canstore a received packet in a buffer and start routing again using thepacket as a new packet. As a result, the relay node R_ND can performrouting that proceeds in the west direction first in the secondalternative route AR12.

The first alternative route AR11 passes through the node at the side(the side at the left end) with one node length of the one-dimensionaljob nodes 1D_JND and the zero-dimension job node 0D_JND allocated in theperipheral region until the first alternative route AR11 reaches therelay node R_ND from the start node ND6. However, the node at the leftend of the one-dimensional job nodes 1D_JND and in contact with thesecond-dimensional job nodes 2D_JND1 transmits and receives a message inthe one-dimensional job nodes to and from only a node on the right.Therefore, the route of the node at the left end of the one-dimensionaljob nodes 1D_JND has enough room for routing in directions other thanthe direction of the node on the right. Therefore, even if the node atthe left end of the one-dimensional job nodes 1D_JND is a via nodethrough which the message passes in the first alternative route AR11,there is no problem in the router of the above node performing therouting processing of the alternative route AR11. Further, since thezero-dimensional job nodes 0D_JND is not transmitting a message, therouter of the zero-dimensional job node 0D_JND has room for the routingprocessing. Therefore, even if the zero-dimension job node 0D_JND is thevia node in the first alternative route AR11, there is no problembecause the zero-dimension job node 0D_JND has enough room forperforming the routing processing.

Similarly, the second alternative route AR12 passes through the twozero-dimensional job nodes 0D_JND allocated to the peripheral regionuntil the second alternative route AR2 reaches the end node ND5 from therelay node R_ND. Because of the same reason as explained above, this vianode has enough room for performing the routing processing of the secondalternative route AR12. Unlike FIG. 12, the second alternative routeAR12 may reach the end node ND5 not through a node in thetwo-dimensional job nodes 2D_JND1 but through only a node in theperipheral region.

FIG. 13 is a diagram depicting an example of the second alternativeroute in this embodiment. As depicted in FIG. 13, it is assumed that thefailure F6 occurs in the center link in the two-dimensional job nodes2D_JND1. In this case, it is theoretically possible to establish, in thetwo-dimensional job nodes 2D_JND1, an alternative route for thecommunication route from the node ND5 to the node ND6 under theWest-fast-turn routing. However, packets of messages are frequentlypropagated in the two-dimensional job nodes 2D_JND1. Therefore, it issometimes undesirable to set an alternative route anew because, forexample, a deadlock occurs in such alternative route.

Therefore, in the example depicted in FIG. 13, the control device 50allocate an empty node in the peripheral region to the relay node R_NDand establishes a first alternative route AR21 that reaches the relaynode R_ND from the start node ND5 and a second alternative route AR22that reaches the end node ND6 from the relay node R_ND.

FIG. 14 is a diagram depicting an example of a third alternative routein this embodiment. In the example depicted in FIG. 14, the controldevice 50 allocates an empty node in the peripheral region to the relaynode R_ND and establishes a first alternative route AR31 that reachesthe relay node R_ND from the start node ND5 and a second alternativeroute AR32 that reaches the end node ND6 from the relay node R_ND.

As an alternative route for the communication route that reaches the endnode ND6 from the start node ND5, several routes are conceivable otherthan the alternative routes explained above. By setting the relay nodein the peripheral region, it is possible to dividedly perform routingfrom a start coordinate to an end coordinate a plurality of times.Therefore, possibility of establishing the alternative route increases.

According to the setting of the alternative route in this embodiment,the alternative route mainly passes the peripheral region of thetwo-dimensional job nodes 2D_JND1 allocated with the important job.Therefore, an extra burden is less likely to be imposed on the router inthe two-dimensional job nodes, and the routing of a packet that is notaffected by a failure location and is not needed to be bypassed is lesslikely to be hindered.

The relay node R_ND is desirably allocated to the empty node E_ND.However, if there is an empty core in the processor of thezero-dimensional job node or the node at the side with the one nodelength of the one-dimensional job nodes, the relay node can be allocatedto the above nodes.

Since the relay node R_ND is desirably allocated to the empty node E_ND,it is desirable to perform job allocation such that the number of emptynodes in the peripheral region is larger than the minimum number needed.Therefore, the control device 50 may allocate empty nodes at a fixedratio with respect to the number of failure locations of thetwo-dimensional job nodes 2D_JND of the important job. As this ratio, areference value serving as a standard may be found by a simulation orthe like in advance.

FIG. 15 is a flowchart of the failure processing in this embodiment. Theprocessor CPU of the control device 50 executes the failure processingprogram 52-2 and performs failure processing explained below. Whenreceiving a failure detection notification from the failure detectingdevices 43 provided in the nodes, the control device 50 registers afailure location of the failure and content of the failure in thefailure location storage table 52-5 (S10). The control device 50 refersto the job execution node storage table 52-4 and checks whether there isa job being executed in the failure occurrence location (S11). If thereis the job being executed in the failure occurrence location (YES inS11) and if the job is an important job that, for example, needs to becontinuously executed (YES in S12), according to a failure type (S14),the control device 50 executes failure processing corresponding to thefailure type.

When the failure location is the processor 40 or the main storage device41 (a processor element PE) in the node, the control device 50 notifiesthe other processes that execution of the job by the processor infailure location is suspended (S15). In this case, the user copes withthe failure through user-level failure mitigation (ULFM).

When the failure location is a failure of the router in the node, thecontrol device 50 moves a process on the processor in the failurelocation to another node (S16). The movement to the other node isdesirably performed through, for example, another network 51 differentfrom the node connection network in the control device 50. When thefailure location is a failure of the link, if the node is isolatedbecause of the failure of the link (YES in S17), it may be impossible tocontinue a process by the node. Therefore, the control device 50 movesthe process on the processor of the isolated node to another node (S16).

When the failure location is a router failure or a link failure, ahindrance sometimes occurs in a transmission route of a message amongthe nodes. Therefore, the control device 50 sets the relay node in theperipheral region of the two-dimensional job nodes in which the failureoccurs, determines an alternative route using the relay node, andrestores the communication route (S18). The control device 50 notifiesall the processes that message communication passing the failurelocation is unsuccessful (S19). Consequently, information concerning thefailure location is also notified to all the processes, that is, thenode executing the job.

FIG. 16 is a flowchart of the processing S18 of the restoration of thecommunication route in FIG. 15. The control device 50 establishes, inthe failure processing, an alternative route for the communication routeinterrupted by the failure and restores the communication route. In thatcase, first, the control device 50 searches for a node appropriate as arelay node out of the nodes in the two-dimensional job nodes of theimportant job (S21 to S27). When an appropriate node is not found, thecontrol device 50 searches for the node appropriate as the relay nodeout of the nodes in the peripheral region of the two-dimensional jobnodes (S28).

The control device 50 extracts a candidate node of the alternative routefrom the vicinity of the failure location (S22) until a counter ireaches an upper limit value (S21 and S27). If a link use ratio of thecandidate node is low (YES in S23) and if there is an empty core in theCPU of the candidate node (YES in S24), the control device 50 allocatesthe candidate node to the relay node and installs and starts a relayprogram (S25). By appropriately setting the upper limit value, accordingto the processing explained above, the control device 50 at firstdetects the node appropriate as the relay node in the nodes in theregion of the two-dimensional job nodes in which the failure occurs.

If the node appropriate as the relay node is not found in the nodes inthe region of the two-dimensional job nodes in which the failure occurs(YES in S27), the control device 50 searches for the node appropriate asthe relay node out of the nodes in the peripheral region of thetwo-dimensional job nodes (S28). This search processing is explainedwith reference to FIG. 17.

After allocating the relay node to any of the nodes, the control device50 notifies a coordinate of the selected relay node to a node that needsto be notified such as a node, the communication route to which isinterrupted (S29). Consequently, the notified node resumes thetransmission of the message using an alternative route passing throughthe relay node set anew.

FIG. 17 is a flowchart of the selection processing for the relay node inthe peripheral region in the processing S28 in FIG. 16. The controldevice 50 sorts the nodes in the peripheral region in the order of theempty node, the zero-dimensional job node, and the node of theone-dimensional job nodes (S31). The control device 50 selects a sortedfirst node (or, in the second time, the next node) as a relay nodecandidate (S32) and checks whether the relay node candidate is realizedas a relay route of an alternative route (S33). This check ofrealizability is a check for determining whether an alternative routecan be established for a predicted failure location. If a probability ofrealization is equal to or greater than a fixed value, the controldevice 50 determines that the relay node candidate is realized as therelay router of the alternative route. If the relay node candidate isrealized as the relay router of the alternative route (YES in S33), thecontrol device 50 calculates effective length of the alternative route(S34). The effective length of the alternative route is calculated bythe following formula with respect to passing length L1 in thetwo-dimensional job node of the important job and passing length L2 ofthe peripheral region.Effective length of the alternative route=a*L1+b*L2where, a and b are weight values and a>b.

That is, the effective length of the alternative route is larger whenthe alternative route passes a node in the two-dimensional job nodes andis smaller when the alternative route passes the peripheral region.Therefore, the effective length is reduced if the alternative routeincludes as small number of passing nodes as possible and includes asmany nodes passing the peripheral region as possible.

The control device 50 applies the selection of the relay node candidate(S32), the determination of the realizability as the relay route (S33),and the calculation of the effective length (S34) to all candidates andselects a candidate having the smallest effective length as the relaynode. If the effective lengths are the same, the empty node ispreferentially selected as the relay node.

In the calculation formula of the effective length of the alternativeroute, if the candidate node is the empty node, the weight value b maybe set smaller. If the candidate node is the zero-dimensional job nodeor the one-dimensional job nodes, the weight value b may be set larger.Consequently, it is possible to make the empty node to be easilyselected as the relay node.

[Routing of the Alternative Route through the Relay Node]

FIG. 18 is a diagram depicting the configuration of the relay node. Likethe normal node depicted in FIG. 5, the relay node includes theprocessor 40, the main storage device 41, the router 42, and the failuredetecting device 43. In the main storage device 41, a relay program41-1, a communication buffer 41-2 that temporarily stores a receivedpacket, and failure location information 41-3 are stored. However, relaynode information 41-4 is not stored in the memory of the relay node.

On the other hand, in the normal node, in the main storage device 41, acommunication program is stored instead of the relay program 41-1. Therelay node information 41-4 is also stored in addition to the failurelocation information 41-3.

The processor 40 of the relay node R_ND executes the relay program 41-1,functions as an end node to receive a packet transmitted by a startnode, and stores the packet in the communication buffer 41-2. In aheader of the received packet, a coordinate of the start node is storedas a start coordinate and a coordinate of the relay node is stored as anend coordinate. Further, the processor 40 of the relay node executes therelay program 41-1, changes the start coordinate in the header of thereceived packet to the coordinate of the relay node and changes the endcoordinate to the coordinate of the end node, and routes the packetagain. As explained below, information concerning the start coordinate,the relay coordinate, and the end coordinate is included in a dataregion of the packet.

FIG. 19 is a diagram for explaining the routing of the alternative routethrough the relay node. In FIG. 19, in a packet transmitted not throughthe relay node as indicated by a broken line arrow, a start coordinateand an end coordinate are stored in a header and a message is stored ina data region. The router of the node through which the packet istransmitted routes the packet to the next node on the basis of the startcoordinate, links through which the packet is transmitted, and the endcoordinate, and on the basis of a routing rule. Therefore, hardware ofthe router of the via node can determine the direction of the routing onthe basis of header information of the packet.

On the other hand, the alternative routes AR31 and AR32 depicted in FIG.19 are the same as the alternative routes AR31 and AR32 depicted in FIG.14. The alternative route depicted in FIG. 19 include the firstalternative routes AR31 from the start node ND5 to the relay node R_NDand the second alternative route AR32 from the relay node R_ND to theend node ND6. The processor of the start node ND5 searches for analternative route that reaches the end node ND6 through the relay nodeR_ND. The processor of the start node ND5 stores the coordinate of thestart node ND5 in the header region of the packet as the startcoordinate, stores the coordinate of the relay node R_ND in the headerregion as the end coordinate, stores information concerning the startcoordinate, the relay coordinate, and the end coordinate in the dataregion of the packet, and transmits the packet. The transmitted packetis subjected to routing processing by normal hardware based on the startcoordinate and the end coordinate in the header by the router of the vianode halfway in the first alternative route AR31 and delivered to therelay node R_ND.

The processor of the relay node R_ND executes the relay program 41-1 andtemporarily stores the received packet in the communication buffer. Theprocessor executes the relay program 41-1, refers to the startcoordinate, the relay coordinate, and the end coordinate in the dataregion of the temporarily-stored packet, writes the coordinate of therelay node in the start coordinate in the header of the buffered packet,writes the coordinate of the end node in the end coordinate in theheader, and transmits the packet, the header information of which ischanged, to the second alternative route AR32. Consequently, the routingprocessing based on the start coordinate and the end coordinate in theheader is performed by the route of the via node halfway in the secondalternative route AR32. The packet is delivered to the end node ND6.

As explained above, in the relay node R_ND, the relay program isinstalled and started. Therefore, rather than performing the normalrouting as a via router, the relay node R_ND generates a packet to betransmitted and routes the generated packet anew, like a start node.Therefore, even under the limitation of the routing, by transmitting thepacket through the relay node, it is possible to restore thecommunication route interrupted by the failure using the alternativeroute bypassing the failure location.

[Example of a Node Arranged in a Peripheral Region of theThree-Dimensional Job Node]

FIG. 20 is a diagram depicting an example of a node arranged in aperipheral region of the three-dimensional job nodes. In job arrangementprocessing, the control device in this embodiment arranges the emptynode E_ND and the zero-dimensional job node 0D_JND in a peripheralregion in contact with a YZ plane of the three-dimensional job nodes3D_JND of the important job. Further, as depicted in FIG. 20, the longside of the one-dimensional job nodes 1D_JND and the long side of thetwo-dimensional job nodes 2D_JND may be arranged in contact with the YZplane of the three-dimensional job nodes 3D_JND of the important job.

A reason for the above is as explained below. As the alternative routeAR, assuming a route that starts from a node inside thethree-dimensional job nodes 3D_JND, passes through the empty node E_NDarranged in the peripheral region on the YZ plane as the relay nodeR_ND, and reaches a node inside the three-dimensional job nodes 3D_JNDfrom the relay node. The alternative route AR proceeds in the Z-axisdirection from the empty node E_ND set as the relay node R-ND, passesthrough a node in the one-dimensional job nodes 1D_JND2 and a node inthe two-dimensional job nodes 2D_JND while proceeding in the Y-axisdirection halfway, and then proceeds in the X-axis direction and reachesthe node in the three-dimensional job nodes 3D_JND.

In this case, whereas the alternative route AR traverses the node in theone-dimensional job nodes 1D_JND2 in the Y-axis direction, the router ofthe node in the one-dimensional job nodes 1D_JND2 mainly routes amessage in the Z-axis direction. Therefore, since the router of the nodein the one-dimensional job nodes 1D_JND2 has enough room concerning therouting in the Y-axis direction, even if the alternative route ARtraverses in the Y-axis direction and the message on the alternativeroute passes, routing of the message within the one-dimensional jobnodes 1D_JND2 is less likely to be affected.

Similarly, the node in the two-dimensional job nodes 2D_JND routes theinternal message limited in a ZX plane. Therefore, even if thealternative route AR traverses in the Y-axis direction and the messageon the alternative route passes through the node of the two-dimensionaljob nodes 2D_JND in the Y-axis direction, routing of the message withinthe two-dimensional job nodes 2D_JND is less likely to be affected.

In this way, a node at a side or a surface with one node length of thetwo-dimensional job nodes 2D_JND or the one-dimensional job nodes 1D_JNDmay be arranged in the peripheral region of the YZ plane of thethree-dimensional job nodes 3D_JND. In this case, an alternative routeis provided in a one node length direction of the side or the surfacewith one node length.

As explained above, with the parallel computer system in thisembodiment, any of the empty nodes not allocated with a job, thezero-dimensional job nodes allocated with the job, and nodes at a sideor a surface with one node length of an M (M=<N or M<N)-dimensional jobnodes allocated with the job are allocated to a peripheral region of anN-dimensional job nodes that executes an important job, for example,requested to be continuously executed. Therefore, it is possible torestore the communication route interrupted by the failure using thealternative route that passes through at least one node in theperipheral region as the relay node. Consequently, it is possible toavoid, as much as possible, stopping a job because of communicationinterruption of a message, allocating a job to a new region, andresuming the job.

All examples and conditional language provided herein are intended forthe pedagogical purposes of aiding the reader in understanding theinvention and the concepts contributed by the inventor to further theart, and are not to be construed as limitations to such specificallyrecited examples and conditions, nor does the organization of suchexamples in the specification relate to a showing of the superiority andinferiority of the invention. Although one or more embodiments of thepresent invention have been described in detail, it should be understoodthat the various changes, substitutions, and alterations could be madehereto without departing from the spirit and scope of the invention.

What is claimed is:
 1. A parallel computer system comprising: a parallelcomputer including nodes connected via communication routes andconfigured to respectively execute calculations; and a control deviceconfigured to allocate a job to a predetermined number of nodes in theparallel computer, wherein the control device includes: a job allocationprocessor configured to allocate, to a peripheral region of firstN-dimensional job nodes allocated with a first job, any of an empty nodenot allocated with a job, a zero-dimensional job node allocated with ajob, and a node at a side or a surface with one node length of M-dimensional job nodes allocated with a job, N being equal to or greaterthan 1 and M being less than N; and a failure processor configured to,when a failure occurs in the first N-dimensional job nodes, allocate atleast one node among the nodes in the peripheral region to a relay node,select a route passing through the relay node as an alternative routefor a communication route in which communication is hindered by thefailure, and execute communication among the nodes via the alternativeroute.
 2. The parallel computer system according to claim 1, wherein thejob allocation processor allocates the first N-dimensional job nodes tobe adjacent to, via the peripheral region, second N-dimensional jobnodes currently executing a second job.
 3. The parallel computer systemaccording to claim 2, wherein the communication route is a route thatconforms to a routing rule and reaches an end node from a start nodethrough a via node, the alternative route includes a first alternativeroute that reaches the relay node from the start node through a via nodeand a second alternative route that reaches the end node from the relaynode through a via node, a packet transmitted by the start node ispropagated through the first alternative route and reaches the relaynode according to the routing rule, and a packet transmitted by therelay node is propagated through the second alternative route andreaches the end node according to the routing rule.
 4. The parallelcomputer system according to claim 3, wherein the relay node buffers thereceived packet, rewrites a start coordinate and an end coordinate ofthe packet, and transmits the rewritten packet through the secondalternative route, and the via node routes the propagated packet on thebasis of the start coordinate and the end coordinate of the packet. 5.The parallel computer system according to claim 3, wherein a directionin which the packet is routed among nodes in the M-dimensional job nodesis different from a direction in which the packet propagated through thealternative route is routed in the node at the side or the surface withone node length of the M-dimensional job nodes.
 6. The parallel computersystem according to claim 1, wherein the communication route is a routethat conforms to a routing rule and reaches an end node from a startnode through a via node, the alternative route includes a firstalternative route that reaches the relay node from the start nodethrough a via node and a second alternative route that reaches the endnode from the relay node through a via node, a packet transmitted by thestart node is propagated through the first alternative route and reachesthe relay node according to the routing rule, and a packet transmittedby the relay node is propagated through the second alternative route andreaches the end node according to the routing rule.
 7. The parallelcomputer system according to claim 6, wherein the relay node buffers thereceived packet, rewrites a start coordinate and an end coordinate ofthe packet, and transmits the rewritten packet through the secondalternative route, and the via node routes the propagated packet on thebasis of the start coordinate and the end coordinate of the packet. 8.The parallel computer system according to claim 6, wherein a directionin which the packet is routed among nodes in the M-dimensional job nodesis different from a direction in which the packet propagated through thealternative route is routed in the node at the side or the surface withone node length of the M-dimensional job nodes.
 9. The parallel computersystem according to claim 1, wherein the failure processor of thecontrol device allocates the empty node in the peripheral region to therelay node.
 10. The parallel computer system according to claim 1,wherein the failure processing unit of the control device selects, asthe relay node, a node through which an alternative route having minimumeffective length passes through as the relay node, from the empty node,the zero-dimensional job node, and the node at the side or the surfacewith one node length of the M-dimensional job nodes.
 11. The parallelcomputer system according to claim 1, wherein the job allocationprocessor of the control unit allocates, to the peripheral region, anyof the zero-dimensional job node and the node at the side or the surfacewith one node length of the M-dimensional job nodes such that the numberof the empty nodes in the peripheral region becomes a minimum value ormore.
 12. A control method of a parallel computer system including: aparallel computer including nodes connected via communication routes andconfigured to respectively execute calculations; and a control deviceconfigured to allocate a job to a predetermined number of nodes in theparallel computer, the control method comprising: causing the controldevice to allocate, to a peripheral region of first N-dimensional jobnodes allocated with a first job, any of an empty node not allocatedwith a job, a zero-dimensional job node allocated with a job, and a nodeat a side or a surface with one node length of M-dimensional job nodesallocated with a job, N being equal to or greater than 1 and M beingless than N; and causing the control device to, when a failure occurs inthe first N-dimensional job node, allocate at least one node among thenodes in the peripheral region to a relay node, select a route passingthrough the relay node as an alternative route for a communication routein which communication is hindered by the failure, and executecommunication among the nodes via the alternative route.